L(A) = L(B)? Decidability Results from Complete Formal Systems
نویسنده
چکیده
The equivalence problem for deterministic pushdown automata is shown to be decidable. We exhibit a complete formal system for deducing equivalent pairs of deterministic rational boolean series on the alphabet associated with a dpda M. We then extend the result to deterministic pushdown transducers from a free monoid into an abelian group. A general algebraic and logical framework, inspired by Harrison et al. (Theoret. Comput. Sci. 9 (1979) 173–205), Conrcelle (Theoret. Comput. Sci. 6 (1978) 255–279) and Meitus (Kybernetika 5 (1989) 14–25 (in Russian)) is developed. c © 2001 Elsevier Science B.V. All rights reserved.
منابع مشابه
Some results on $L$-complete lattices
The paper deals with special types of $L$-ordered sets, $L$-fuzzy complete lattices, and fuzzy directed complete posets.First, a theorem for constructing monotone maps is proved, a characterization for monotone maps on an $L$-fuzzy complete lattice is obtained, and it's proved that if $f$ is a monotone map on an $L$-fuzzy complete lattice $(P;e)$, then the least fixpoint of $f$ is meet of a spe...
متن کاملCompleteness results for metrized rings and lattices
The Boolean ring $B$ of measurable subsets of the unit interval, modulo sets of measure zero, has proper radical ideals (for example, ${0})$ that are closed under the natural metric, but has no prime ideal closed under that metric; hence closed radical ideals are not, in general, intersections of closed prime ideals. Moreover, $B$ is known to be complete in its metric. Togethe...
متن کاملar X iv : 0 70 8 . 35 64 v 1 [ cs . L O ] 2 7 A ug 2 00 7 Deciding security properties for cryptographic protocols . Application to key cycles ⋆
There has been a growing interest in applying formal methods for validating cryptographic protocols and many results have been obtained. In this paper, we re-investigate and extend the NP-complete decision procedure for a bounded number of sessions [33]. In this setting, constraint systems are now a standard for modeling security protocols. We provide a generic approach to decide general securi...
متن کاملrepresentation theorems of $L-$subsets and $L-$families on complete residuated lattice
In this paper, our purpose is twofold. Firstly, the tensor andresiduum operations on $L-$nested systems are introduced under thecondition of complete residuated lattice. Then we show that$L-$nested systems form a complete residuated lattice, which isprecisely the classical isomorphic object of complete residuatedpower set lattice. Thus the new representation theorem of$L-$subsets on complete re...
متن کاملThe Decidability of the Generalized Confluence Problem for Context-Free Languages
A language L is con uent with respect to a given quasi order on if, for any x; y 2 L, there is z 2 L such that x z and y z. L is con uent with respect to in generalized sense if it is a nite union of languages conuent with respect to . We investigate in this paper the decidability of the generalized con uence problem with respect to the pre x partial order and the factor partial order for conte...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Theor. Comput. Sci.
دوره 251 شماره
صفحات -
تاریخ انتشار 2001